Sparse Grid Discretizations based on a Discontinuous Galerkin Method

نویسندگان

  • Alexander B. Atanasov
  • Erik Schnetter
چکیده

We examine and extend Sparse Grids as a discretization method for partial differential equations (PDEs). Solving a PDE in D dimensions has a cost that grows as O(ND) with commonly used methods. Even for moderate D (e.g. D = 3), this quickly becomes prohibitively expensive for increasing problem size N . This effect is known as the Curse of Dimensionality. Sparse Grids offer an alternative discretization method with a much smaller cost of O(N logD−1N). In this paper, we introduce the reader to Sparse Grids, and extend the method via a Discontinuous Galerkin approach. We then solve the scalar wave equation in up to 6+1 dimensions, comparing cost and accuracy between full and sparse grids. Sparse Grids perform far superior, even in three dimensions. Our code is freely available as open source, and we encourage the reader to reproduce the results we show.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hash Data Structure for Adaptive PDE–Solvers Based on Discontinuous Galerkin Discretizations

Adaptive multiscale methods are among the most effective techniques for the numerical solution of partial differential equations. Efficient grid management is an important task in these solvers. In this paper we focus on this problem for Discontinuous Galerkin discretization methods in 2 and 3 spatial dimensions and present a data structure for handling adaptive grids of different cell types in...

متن کامل

A Sparse Grid Discontinuous Galerkin Method for High-Dimensional Transport Equations and Its Application to Kinetic Simulations

In this talk, we present a sparse grid discontinuous Galerkin (DG) scheme for transport equations and applied it to kinetic simulations. The method uses the weak formulations of traditional Runge-Kutta DG schemes for hyperbolic problems and is proven to be L stable and convergent. A major advantage of the scheme lies in its low computational and storage cost due to the employed sparse finite el...

متن کامل

Robust smoothers for high order discontinuous Galerkin discretizations of advection-diffusion problems

The multigrid method for discontinuous Galerkin discretizations of advection-diffusion problems is presented. It is based on a block Gauss-Seidel smoother with downwind ordering honoring the advection operator. The cell matrices of the DG scheme are inverted in this smoother in order to obtain robustness for higher order elements. Employing a set of experiments, we show that this technique actu...

متن کامل

Smoothed aggregation multigrid solvers for high-order discontinuous Galerkin methods for elliptic problems

We develop a smoothed aggregation-based algebraic multigrid solver for high-order discontinuous Galerkin discretizations of the Poisson problem. Algebraic multigrid is a popular and effective method for solving the sparse linear systems that arise from discretizing partial differential equations. However, high-order discontinuous Galerkin discretizations have proved challenging for algebraic mu...

متن کامل

Domain Decomposition for Discontinuous Galerkin Method with Application to Stokes Flow

We report on recent results related to domain decomposition methods based on the Discontinuous Galerkin discretizations of Stokes equations. We analyze the efficiency of a block nonoverlapping Schwarz preconditioner based on the approach by Feng and Karakashian [2001]. We also prove the inf-sup stability of a substructuring method.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1710.09356  شماره 

صفحات  -

تاریخ انتشار 2017